Storage of spatially correlated patterns in autoassociative memories
نویسنده
چکیده
The effects of spatially organised data on autoassociative neural networks are investigated in the optimal storage case. An analytical study is possible for weak spatial correlations. It predicts an increasing of the storage capacity ac and ferromagnetic means for the couplings. Numerical simulations confirm these results for large spatial correlations.
منابع مشابه
Brouwerian Autoassociative Morphological Memories and Their Relation to Traditional and Sparsely Connected Autoassociative Morphological Memories
Autoassociative morphological memories (AMM) are memory models that use operations of mathematical morphology for the storage and recall of pattern associations. These models can be very well de ned in a mathematical structure called complete lattice. In this paper, we introduce the Brouwerian autoassociative morphological memories (BAMMs) that are de ned on a complete Brouwerian lattice. The a...
متن کاملMemory Dynamics in Attractor Networks with Saliency Weights
Memory is a fundamental part of computational systems like the human brain. Theoretical models identify memories as attractors of neural network activity patterns based on the theory that attractor (recurrent) neural networks are able to capture some crucial characteristics of memory, such as encoding, storage, retrieval, and long-term and working memory. In such networks, long-term storage of ...
متن کاملSparsely Connected Autoassociative Fuzzy Implicative Memories for the Reconstruction of Large Gray-Scale Images
Autoassociative fuzzy implicative memories (AFIMs) are models that exhibit optimal absolute storage capacity and an excellent tolerance with respect to incomplete or eroded patterns. Thus, they can be effectively used for the reconstruction of gray-scale images. In practice, however, applications of AFIMs are confined to images of small size due to computational limitations. This paper introduc...
متن کاملEfficient and optimal binary Hopfield associative memory storage using minimum probability flow
We present an algorithm to store binary memories in a Hopfield neural network using minimum probability flow, a recent technique to fit parameters in energybased probabilistic models. In the case of memories without noise, our algorithm provably achieves optimal pattern storage (which we show is at least one pattern per neuron) and outperforms classical methods both in speed and memory recovery...
متن کاملEfficient and optimal Little-Hopfield auto-associative memory storage using minimum probability flow
We present an algorithm to store binary memories in a Little-Hopfield neural network using minimum probability flow, a recent technique to fit parameters in energy-based probabilistic models. In the case of memories without noise, our algorithm provably achieves optimal pattern storage (which we show is at least one pattern per neuron) and outperforms classical methods both in speed and memory ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016